Fractal rational functions and their approximation properties

Approximation by Rational Functions

Approximation by Rational Functions

Making use of the Hardy-Littlewood maximal function, we give a new proof of the following theorem of Pekarski: If f' is in L log L on a finite interval, then f can be approximated in the uniform norm by rational functions of degree n to an error 0(1/n) on that interval. It is well known that approximation by rational functions of degree n can produce a dramatically smaller error than that for p...

Approximation by Rational Functions in

The denseness of rational functions with prescribed poles in the Hardy space and disk algebra is considered. Notations. C complex plane D unit disk fz : jzj < 1g Tunit circle fz : jzj = 1g H p Hardy space of analytic functions on D kfk 1 := supfjf(z)j : z 2 D g, the H 1 norm A(D) disk algebra of functions analytic on D and continuous on D P n set of polynomials of degree at most n

Multipoint Schur’s algorithm, rational orthogonal functions, asymptotic properties and Schur rational approximation

In [20] the connections between the Schur algorithm, the Wall’s continued fractions and the orthogonal polynomials are revisited and used to establish some nice convergence properties of the sequence of Schur functions associated with a Schur function. In this report, we generalize some of Krushchev’s results to the case of a multipoint Schur algorithm, that is a Schur algorithm where all the i...

Simultaneous Rational Approximation to Binomial Functions

We apply Padé approximation techniques to deduce lower bounds for simultaneous rational approximation to one or more algebraic numbers. In particular, we strengthen work of Osgood, Fel’dman and Rickert, proving, for example, that max {∣∣∣√2− p1/q∣∣∣ , ∣∣∣√3− p2/q∣∣∣} > q−1.79155 for q > q0 (where the latter is an effective constant). Some of the Diophantine consequences of such bounds will be d...